منابع مشابه
Local Self-concordance of Barrier Functions Based on Kernel-functions
Many efficient interior-point methods (IPMs) are based on the use of a self-concordant barrier function for the domain of the problem that has to be solved. Recently, a wide class of new barrier functions has been introduced in which the functions are not self-concordant, but despite this fact give rise to efficient IPMs. Here, we introduce the notion of locally self-concordant barrier functio...
متن کاملAveraging of kernel functions
In kernel-based machines, the integration of a number of different kernels to build more flexible learning methods is a promising avenue for research. In multiple kernel learning, a compound kernel is build by learning a kernel that is a positively weighted arithmetic mean of several sources. We show in this paper that the only feasible average for kernel learning is precisely the arithmetic av...
متن کاملKernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with kernel machines. In particular we show that decision trees and disjunctive normal forms (DNF) can be represented by the help of a special kernel, linking regularized risk to separation margin. Subsequently we derive a...
متن کاملA Theorem for Kernel Functions
Let B be a domain lying in the complex z plane and KB(z, t) its kernel function. A number of relationships exist between the kernel and the geometric properties of the domain. (See, for example, [l].)1 It is the purpose of the present note to relate the successive derivatives of the kernel with the domain B. If z is interior to B, we shall denote by rB(z) the shortest distance from the point z ...
متن کاملEvolutionary Optimisation of Kernel Functions for Svms
The kernel-based classifiers use one of the classical kernels, but the real-world applications have emphasized the need to consider a new kernel function in order to boost the classification accuracy by a better adaptation of the kernel function to the characteristics of the data. Our purpose is to automatically design a complex kernel by evolutionary means. In order to achieve this purpose we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2008
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.23.185